package history.hot100.simple;

import history.hot100.TreeNode;

import java.util.ArrayList;
import java.util.List;

// 94. 二叉树的中序遍历:https://leetcode-cn.com/problems/binary-tree-inorder-traversal/
public class LeetCode_94 {
    List result = new ArrayList();
    public List<Integer> inorderTraversal(TreeNode root) {
        if (root == null) return result;
        inorderTraversal(root.left);
        result.add(root.val);
        inorderTraversal(root.right);
        return result;
    }
}
